Specification Translation of State Machines from Equational Theories into Rewrite Theories

نویسندگان

  • Min Zhang
  • Kazuhiro Ogata
  • Masaki Nakamura
چکیده

Specifications of state machines in CafeOBJ are called equational theory specifications (EQT Specs) which are based on equational logic, and in Maude are called rewrite theory specifications (RWT Specs) which are based on rewriting logic. The translation from EQT Specs to RWT Specs achieves the collaboration between CafeOBJ’s theorem proving facilities and Maude’s model checking facilities. However, translated specifications by existing strategies are of inefficiency and rarely used for model checking in practice. This paper defines a specific class of EQT Specs called EADS Specs, and proposes a strategy for the translation from EADS Specs to RWT Specs. It is proved that translated specifications by the strategy are more efficient than those by existing strategies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Facilitating the Transformation of State Machines from Equations into Rewrite Rules

The multiplicity of formalisms and corresponding verification systems makes the transformation useful for interoperations among them. We have proposed an approach to the transformation of state machines from a syntax-constrained class of equational theories into rewrite theories, which can be verified by Maude’s model checking facilities. However, the efficiency of model checking generated rewr...

متن کامل

An Invariant-preserved Transformation of State Machines from Equations into Rewrite Rules

We present an approach to the transformation of state machines from a restricted subclass of equational theories into rewrite theories, and show the transformation preserves invariant properties. Invariantpreservation of the transformation guarantees that a counterexample that is found to an invariant by model checking a generated rewrite theory is also the counterexample to the corresponding i...

متن کامل

Equational Specification of UML+OCL Static Class Diagrams

In this paper we propose an equational specification of UML+OCL static class diagrams that provides a formal foundation for automatically validating UML object diagrams with respect to OCL constraints. Basically, class and object UML diagrams are specified as membership equational theories, and OCL expressions are represented as terms over extensions of those theories. Then, validating object d...

متن کامل

Equational Abstractions for Reducing the State Space of Rewrite Theories

The combinatorial explosion of state spaces is the biggest problem in applying model checking methods to concurrent systems. In this paper we present a new state-space reduction technique that is tailored to system specifications in Rewriting Logic, a unified semantic framework for concurrency which is based on conditional term rewriting modulo equational theories. The idea is to hide “unimport...

متن کامل

Using Reflection to Implement in Maude a Rewriting-Based Validation Tool for UML+OCL Static Class Diagrams

In this paper we present the ITP/OCL tool, a rewritingbased tool that supports automatic validation of UML static class diagrams with respect to OCL invariants. From a conceptual point of view, the ITP/OCL tool is directly based on the equational specification of UML+OCL class diagrams developed in [11], according to which: i) class and object diagrams are specified as membership equational the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010